/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution2 {
////    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
////           ListNode newHead = new ListNode(0) ;
////           ListNode last = newHead ;
////           int ret = 0 ;
////           ListNode cur1 = l1 , cur2 = l2 ;
////           while(cur1 != null && cur2 != null){
////               int v1 = cur1.val , v2 = cur2.val ;
////               ListNode node = new ListNode() ;
////               node.val = (v1+v2+ret)%10 ;
////               ret = (v1+v2+ret)/10 ;
////               last.next = node ;
////               last = last.next ;
////               cur1 = cur1.next ;
////               cur2 = cur2.next ;
////           }
////           while(cur1 != null){
////               int v1 = cur1.val ;
////               ListNode node = new ListNode() ;
////               node.val = (v1+ret)%10 ;
////               ret = (v1+ret)/10 ;
////               last.next = node ;
////               last = last.next ;
////                cur1 = cur1.next ;
////           }
////            while(cur2 != null){
////               int v2 = cur2.val ;
////               ListNode node = new ListNode() ;
////               node.val = (v2+ret)%10 ;
////               ret = (v2+ret)/10 ;
////               last.next = node ;
////               last = last.next ;
////               cur2 = cur2.next ;
////           }
////           if(ret > 0){
////            ListNode node = new ListNode(ret) ;
////            last.next = node ;
////           }
////           return newHead.next;
//    }
}